منابع مشابه
Optimal Belief Approximation
In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a ranking function that quantifies how “embarrassing” it is to communicate a given approximation. We show that there is only one ranking under the requirements that (1) the best ranked approximation is the non-...
متن کاملApproximation Of Belief Functions
This paper addresses the approximation of belief functions by probability functions where the approximation is based on minimizing the Euclidean distance. First of all, we simplify this optimization problem so it becomes equivalent to a standard problem in linear algebra. For the simplified optimization problem, we provide the analytic solution. Furthermore, we show that for Dempster-Shafer bel...
متن کاملA Note on Belief Structures and S-approximation Spaces
We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory...
متن کاملOptimal Belief Revision
We propose a new approach to belief revision that provides a way to change knowledge bases with a minimum of effort. We call this way of revising belief states optimal belief revision. Our revision method gives special attention to the fact that most belief revision processes are directed to a specific informational objective. This approach to belief change is founded on notions such as optimal...
متن کاملOptimal decomposition of belief networks
In this paper, optimum decomposition of belief networks is discussed. Some methods of decom position are examined and a new method the method of Minimum Total Number of States (MTNS)is proposed. The problem of optimum belief network decomposition under our frame work, as under all the other frameworks, is shown to be NP-hard. According to the computational complexity analysis, an algorithm of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2017
ISSN: 1099-4300
DOI: 10.3390/e19080402